Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Automatic method for left atrial appendage segmentation from ultrasound images based on deep learning
HAN Luyi, HUANG Yunzhi, DOU Haoran, BAI Wenjuan, LIU Qi
Journal of Computer Applications    2019, 39 (11): 3361-3365.   DOI: 10.11772/j.issn.1001-9081.2019040771
Abstract547)      PDF (885KB)(245)       Save
Segmenting Left Atrial Appendage (LAA) from ultrasound image is an essential step for obtaining the clinical indicators, and the prerequisite and difficulty for automatic and accurate segmentation is locating the target accurately. Therefore, a method combining with automatic location based on deep learning and segmenting algorithm based on model was proposed to accomplish the automatic segmentation of LAA from ultrasound images. Firstly, You Only Look Once (YOLO) model was trained as the network structure for the automatic location of LAA. Secondly, the optimal weight files were determined by the validation set and the bounding box of LAA was predicted. Finally, based on the correct location, the bounding box was magnified 1.5 times as the initial contour, and C-V (Chan-Vese) model was utilized to realize the automatic segmentation of LAA. The performance of automatic segmentation was evaluated by 5 metrics, including accuracy, sensitivity, specificity, positive, and negative. The experimental results show that the proposed method can achieve a good automatic segmentation in different resolutions and visual modes, small samples data achieve the optimal location performance at 1000 iterations with a correct position rate of 72.25%, and C-V model can reach the accuracy of 98.09% based on the correct location. Therefore, deep learning is a rather promising technique in the automatic segmentation of LAA from ultrasound images, and it can provide a good initial contour for the segmentation algorithm based on contour.
Reference | Related Articles | Metrics
Design of virtual surgery system in reduction of maxillary fracture
LI Danni, LIU Qi, TIAN Qi, ZHAO Leiyu, HE Ling, HUANG Yunzhi, ZHANG Jing
Journal of Computer Applications    2015, 35 (6): 1730-1733.   DOI: 10.11772/j.issn.1001-9081.2015.06.1730
Abstract562)      PDF (660KB)(403)       Save

Based on open source softwares of Computer Haptics, visualizAtion and Interactive in 3D (CHAI 3D) and Open Graphic Library (OpenGL), a virtual surgical system was designed for reduction of maxillary fracture. The virtual simulation scenario was constructed with real patients' CT data. A geomagic force feedback device was used to manipulate the virtual 3D models and output haptic feedback. On the basis of the original single finger-proxy algorithm, a multi-proxy collision algorithm was proposed to solve the problem that the tools might stab into the virtual organs during the simulation. In the virtual surgical system, the operator could use the force feedback device to choose, move and rotate the virtual skull model to simulate the movement and placement in real operation. The proposed system can be used to train medical students and for preoperative planning of complicated surgeries.

Reference | Related Articles | Metrics
EDL: new approach on supporting insert-friendly XML node labels
QIN Zun-yue HUANG Yun CAI Guo-min LIANG Ping-yuan
Journal of Computer Applications    2012, 32 (12): 3540-3543.   DOI: 10.3724/SP.J.1087.2012.03540
Abstract746)      PDF (747KB)(456)       Save
Labeling ordered XML documents can process XML data without accessing the data files. The present labeling schemes have achieved better results in queries, however, the labeling schemes for insertions incurs sacrifices of query performance, lower updates efficiency, and other problems. This paper proposed a new labeling scheme for insertions, EDL(Extended Dewey Labeling), which efficiently realizes the calculations in the insertions of XML documents without degrading query performance . The conducted experiments have shown that EDL is superior to the similar labeling schemes for updates.
Related Articles | Metrics
Approximate subgraph matching based on dual index
HUANG Yun HONG Jia-ming QIN Zun-yue
Journal of Computer Applications    2012, 32 (07): 1994-1997.   DOI: 10.3724/SP.J.1087.2012.01994
Abstract790)      PDF (612KB)(561)       Save
The fast increasing large and complex networks make the research of graph structure more and more important, in which approximate subgraph query is of big concern. Constructing index for each vertex by the adjacency characteristics was able to reduce the number of matched vertices, and partitioning the large graph based on label and structure information was able to reduce the matching search space. Using the dual index built in offline time, large amount of candidate vertices were filtered out according to the adjacency discriminant formula, and then the edge matching was carried out in some partition spaces. The experiments on real dataset show that, compared with many other existing methods, the dual-index query mechanism improves the efficiency and accuracy of subgraph matching significantly.
Reference | Related Articles | Metrics
Molecular toxicity prediction based on meta graph isomorphism network
HUANG Yunchuan, JIANG Yongquan, HUANG Juntao, YANG Yan,
Journal of Computer Applications    DOI: 10.11772/j.issn.1001-9081.2023091286
Online available: 15 March 2024